全文获取类型
收费全文 | 294篇 |
免费 | 61篇 |
国内免费 | 11篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 4篇 |
2021年 | 8篇 |
2020年 | 8篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 16篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 20篇 |
2012年 | 16篇 |
2011年 | 25篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 24篇 |
2007年 | 21篇 |
2006年 | 21篇 |
2005年 | 18篇 |
2004年 | 12篇 |
2003年 | 11篇 |
2002年 | 11篇 |
2001年 | 12篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有366条查询结果,搜索用时 507 毫秒
21.
22.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
23.
通过对应急装备保障实际场景的分析,提出装备应急运输过程应分2个不同的阶段进行研究。重点讨论了第1阶段涉及的运输问题,并建立相应数学模型。通过数学软件matlab实现了模型的求解,最后通过算例分析证明了模型的有效性。为相关运输问题的解决提供了一种有效的方法。 相似文献
24.
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献
25.
研究非齐次边界条件下,含有p-Laplacian算子的微分方程的可解性,在Banach空间中应用Krasnoselskii不动点定理,得到了边值问题正解存在性结果。 相似文献
26.
Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016 相似文献
27.
论图书馆员服务的真善美价值 总被引:3,自引:0,他引:3
柴平 《兵团教育学院学报》2003,13(2):79-81
图书馆员服务需要真、善、美,服务价值是真、善、美的统一,也是图书馆员服务的升华。 相似文献
28.
赵淑燕 《中国人民武装警察部队学院学报》2008,24(7):82-84
美国的辩诉交易制度具有重要的理论价值和现实意义。有必要借鉴国外辩诉交易制度的合理因素,建立中国式的辩诉交易制度。建立中国式的辩诉交易制度,应对其适用条件、适用案件的范围及适用程序做出明确规定。 相似文献
29.
网络信息时代,面对层出不穷的不良信息,如何提高官兵抵制负面影响的素质能力,概括起来就是:要针对不良信息“腐蚀性”强的特点,不断培育官兵“乐于追随”的不变定力;要针对不良信息“迷惑性”强的特点,不断培育官兵“善于思辨”的不凡智力;要针对不良信息“煽动性”强的特点,不断培育官兵“敢于斗争”的不惧魄力;要针对不良信息“持久性”强的特点,不断培育官兵“甘于奉献”的不竭动力。 相似文献
30.
随着大规模分子相互作用数据的不断涌现,生物学网络方面的研究正日益得到重视.代谢网络处于生物体的功能执行阶段,其结构组成方式不仅反映了生物体的功能构成,也直接影响代谢工程中的途径分析和研究.作为代谢网络研究的重要环节,实现网络的合理分解不仅对于基因组范围内分子网络的结构和功能研究具有重要意义,也是代谢工程的途径分析和优化得以顺利进行的前提之一.在回顾代谢网络宏观结构和拓扑特征研究成果的基础上,通过对现有分解方法的深入分析,指出缺乏合理且有针对性的模型评估准则是目前网络分解研究中亟待解决的问题之一.今后的研究趋势在于如何整合更多的信息和发展更先进的分析方法,建立更合理的模型,并进一步拓展网络分解的应用范围. 相似文献